recursive data types - определение. Что такое recursive data types
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое recursive data types - определение

A DATA TYPE THAT REFERS TO ITSELF IN ITS DEFINITION
Isorecursive type; Isorecursive; Equirecursive; Equirecursive type; Recursive type; Recursive data structure; Inductively-defined data type; Recursive datatype; Recursively-defined data type; Inductive data type (recursive data); Recursive data; Mutually recursive data type
Найдено результатов: 3988
Recursive data type         
In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. Data of recursive types are usually viewed as directed graphs.
recursive type         
A data type which contains itself. The commonest example is the list type, in Haskell: data List a = Nil | Cons a (List a) which says a list of a's is either an empty list or a {cons cell} containing an 'a' (the "head" of the list) and another list (the "tail"). Recursion is not allowed in Miranda or Haskell {synonym types}, so the following Haskell types are illegal: type Bad = (Int, Bad) type Evil = Bool -> Evil whereas the seeminly equivalent algebraic data types are acceptable: data Good = Pair Int Good data Fine = Fun (Bool->Fine)
General recursive function         
ONE OF SEVERAL EQUIVALENT DEFINITIONS OF A COMPUTABLE FUNCTION
Partial recursive function; Total recursive function; Mu-recursive; Mu recursive function; Mu-recursive function; Recursive function theory; M-recursive function; Μ recursion; General-recursive; General recursive; Recursive function (computability); Μ-recursive function; Μ-recursive
In mathematical logic and computer science, a general recursive function, partial recursive function, or μ-recursive function is a partial function from natural numbers to natural numbers that is "computable" in an intuitive sense – as well as in a formal one. If the function is total, it is also called a total recursive function (sometimes shortened to recursive function).
Data (computing)         
  • Various types of data which can be visualized through a computer device
QUANTITIES, CHARACTERS, OR SYMBOLS ON WHICH OPERATIONS ARE PERFORMED BY A COMPUTER
Computer data; Type representation; Data (computing)
In computing, data (treated as singular, plural, or as a mass noun) is any sequence of one or more symbols. Datum is a single symbol of data.
Data (computer science)         
  • Various types of data which can be visualized through a computer device
QUANTITIES, CHARACTERS, OR SYMBOLS ON WHICH OPERATIONS ARE PERFORMED BY A COMPUTER
Computer data; Type representation; Data (computing)
In computer science, data (treated as singular, plural, or as a mass noun) is any sequence of one or more symbols; datum is a single symbol of data. Data requires interpretation to become information.
Data publishing         
  • A data citation example
ACT OF MAKING RESEARCH DATASETS AVAILABLE, OFTEN A LARGE QUANTITY AT ONE TIME
Data citation; Data paper; Data publication; Data journal; Data attribution; Citation of data; Attribution of data
Data publishing (also data publication) is the act of releasing research data in published form for use by others. It is a practice consisting in preparing certain data or data set(s) for public use thus to make them available to everyone to use as they wish.
Data cleansing         
PROCESS OF DETECTING AND CORRECTING (OR REMOVING) CORRUPT, INACCURATE OR UNWANTED RECORDS FROM A RECORD SET
Data cleaning; Data Cleaning; User:Aceldam/Cleansing and Conforming Data; Cleansing and conforming data; Statistical data editing; Cleansing and Conforming Data
Data cleansing or data cleaning is the process of detecting and correcting (or removing) corrupt or inaccurate records from a record set, table, or database and refers to identifying incomplete, incorrect, inaccurate or irrelevant parts of the data and then replacing, modifying, or deleting the dirty or coarse data. Data cleansing may be performed interactively with data wrangling tools, or as batch processing through scripting or a data quality firewall.
Data URI scheme         
WEB PAGE IN-LINE DATA SCHEME
Data:; Data: URL; Data URL; Data Url; Data URI; Data Uri; Data: URI; Inline image; Data: uri scheme; Data: URI scheme; Data urls; Data://; Data URIs; Data-URI
The data URI scheme is a uniform resource identifier (URI) scheme that provides a way to include data in-line in Web pages as if they were external resources. It is a form of file literal or here document.
inline image         
WEB PAGE IN-LINE DATA SCHEME
Data:; Data: URL; Data URL; Data Url; Data URI; Data Uri; Data: URI; Inline image; Data: uri scheme; Data: URI scheme; Data urls; Data://; Data URIs; Data-URI
<World-Wide Web> An image that appears within the body of a web page. Most graphical web browsers can display both GIF and JPG images inline. The web browser may give the user an option to turn off inline images, to speed up the display of web pages. Other image formats may have to be displayed in a separate window and/or by another application program. An inline image in a web page is achieved with the <IMG> HTML tag, which can take many attributes. The SRC attribute gives the URL from which to fetch the image and the ALT attribute gives text to display in place of the image for users with images disabled or who are using text-only browsers or text-to-speech convertors (e.g. blind users). (1999-10-27)
Generalized algebraic data type         
Generalized Algebraic Data Types; GADT; Generalized algebraic data types; GADTs; First-class phantom types; Guarded recursive data types; Generalized algebraic datatypes; Generalized Algebraic Data Type; Generalized algebraic datatype; Equality-qualified type; Equality qualified type; First-class phantom type; First class phantom type; Guarded recursive datatype; Guarded recursive data type; Generalized abstract data type; Generalized Abstract Data Type
In functional programming, a generalized algebraic data type (GADT, also first-class phantom type, guarded recursive datatype, or equality-qualified type) is a generalization of parametric algebraic data types.

Википедия

Recursive data type

In computer programming languages, a recursive data type (also known as a recursively-defined, inductively-defined or inductive data type) is a data type for values that may contain other values of the same type. Data of recursive types are usually viewed as directed graphs.

An important application of recursion in computer science is in defining dynamic data structures such as Lists and Trees. Recursive data structures can dynamically grow to an arbitrarily large size in response to runtime requirements; in contrast, a static array's size requirements must be set at compile time.

Sometimes the term "inductive data type" is used for algebraic data types which are not necessarily recursive.